/* Mainly the interface between cpplib and the C front ends.
   Copyright (C) 2010 Albert Faber.

GCC is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free
Software Foundation; either version 3, or (at your option) any later
version.

GCC is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
for more details.

You should have received a copy of the GNU General Public License
along with GCC; see the file COPYING3.  If not see
<http://www.gnu.org/licenses/>.  */

#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "tm.h"

#include "real.h"
#include "rtl.h"
#include "tree.h"
#include "input.h"
#include "output.h"
#include "jal-tree.h"
#include "c-common.h"
#include "flags.h"
#include "timevar.h"
#include "cpplib.h"
#include "c-pragma.h"
#include "toplev.h"
#include "intl.h"
#include "tm_p.h"
#include "splay-tree.h"
#include "debug.h"
#include "target.h"
#include "jal-lex.h"
#include "jal-cpp.h"
#include "jal-opts.h"

/* We may keep statistics about how long which files took to compile.  */
static int header_time, body_time;
static splay_tree file_info_tree;

int pending_lang_change; /* If we need to switch languages - C++ only */
int c_header_level;	 /* depth in C headers - C++ only */

static tree interpret_integer (const cpp_token *, unsigned int);
static tree interpret_float (const cpp_token *, unsigned int);
static tree interpret_fixed (const cpp_token *, unsigned int);
static enum integer_type_kind narrowest_unsigned_type
	(unsigned HOST_WIDE_INT, unsigned HOST_WIDE_INT, unsigned int);
static enum integer_type_kind narrowest_signed_type
	(unsigned HOST_WIDE_INT, unsigned HOST_WIDE_INT, unsigned int);
static enum cpp_ttype lex_string (const cpp_token *, tree *, bool, bool);
static tree lex_charconst (const cpp_token *);
static void update_header_times (const char *);
static int dump_one_header (splay_tree_node, void *);
static void cb_line_change (cpp_reader *, const cpp_token *, int);
static void cb_ident (cpp_reader *, unsigned int, const cpp_string *);
static void cb_def_pragma (cpp_reader *, unsigned int);
static void cb_define (cpp_reader *, unsigned int, cpp_hashnode *);
static void cb_undef (cpp_reader *, unsigned int, cpp_hashnode *);
struct c_fileinfo *get_fileinfo (const char *name);
static int jal_lexer_do_trace(const char *format, ...);

static int jal_lexer_do_trace(const char *format, ...)
{  
	va_list arguments;
	va_start(arguments, format);
	if ( option_lexer_trace!=0 )
	{
		vfprintf(stderr, format, arguments);
	}
	va_end(arguments);
	return(0);
}

#define jal_lexer_trace(format, ...) { jal_lexer_do_trace("%s(%d): ", __FUNCTION__, __LINE__ ); jal_lexer_do_trace( format, ## __VA_ARGS__); jal_lexer_do_trace("\n" ); }


void
init_jal_lex (void)
{
  struct cpp_callbacks *cb;
  struct c_fileinfo *toplevel;

  printf( "START init_jal_lex\n");

  /* The get_fileinfo data structure must be initialized before
     cpp_read_main_file is called.  */
  toplevel = get_fileinfo ("<top level>");
  if (flag_detailed_statistics)
    {
      header_time = 0;
      body_time = get_run_time ();
      toplevel->time = body_time;
    }

  /* Set the debug callbacks if we can use them.  */
  if (debug_info_level == DINFO_LEVEL_VERBOSE
      && (write_symbols == DWARF2_DEBUG
	  || write_symbols == VMS_AND_DWARF2_DEBUG))
    {
      cb->define = cb_define;
      cb->undef = cb_undef;
    }
  printf( "DONE init_jal_lex\n");
}

struct c_fileinfo *
get_fileinfo (const char *name)
{
  splay_tree_node n;
  struct c_fileinfo *fi;

  if (!file_info_tree)
    file_info_tree = splay_tree_new ((splay_tree_compare_fn) strcmp,
				     0,
				     (splay_tree_delete_value_fn) free);

  n = splay_tree_lookup (file_info_tree, (splay_tree_key) name);
  if (n)
    return (struct c_fileinfo *) n->value;

  fi = XNEW (struct c_fileinfo);
  fi->time = 0;
  fi->interface_only = 0;
  fi->interface_unknown = 1;
  splay_tree_insert (file_info_tree, (splay_tree_key) name,
		     (splay_tree_value) fi);
  return fi;
}

static void
update_header_times (const char *name)
{

  ///* Changing files again.  This means currently collected time
  //   is charged against header time, and body time starts back at 0.  */
  //if (flag_detailed_statistics)
  //  {
  //    int this_time = get_run_time ();
  //    struct c_fileinfo *file = get_fileinfo (name);
  //    header_time += this_time - body_time;
  //    file->time += this_time - body_time;
  //    body_time = this_time;
  //  }
}

static int
dump_one_header (splay_tree_node n, void * ARG_UNUSED (dummy))
{
  print_time ((const char *) n->key,
	      ((struct c_fileinfo *) n->value)->time);
  return 0;
}

void
jal_lex_dump_time_statistics (void)
{
  struct c_fileinfo *file = get_fileinfo (input_filename);
  int this_time = get_run_time ();
  file->time += this_time - body_time;

  fprintf (stderr, "\n******\n");
  print_time ("header files (total)", header_time);
  print_time ("main file (total)", this_time - body_time);
  fprintf (stderr, "ratio = %g : 1\n",
	   (double) header_time / (double) (this_time - body_time));
  fprintf (stderr, "\n******\n");

  splay_tree_foreach (file_info_tree, dump_one_header, 0);
}

static void
cb_ident (cpp_reader * ARG_UNUSED (pfile),
	  unsigned int ARG_UNUSED (line),
	  const cpp_string * ARG_UNUSED (str))
{
#ifdef ASM_OUTPUT_IDENT
  if (!flag_no_ident)
    {
      /* Convert escapes in the string.  */
      cpp_string cstr = { 0, 0 };
      if (cpp_interpret_string (pfile, str, 1, &cstr, CPP_STRING))
	{
	  ASM_OUTPUT_IDENT (asm_out_file, (const char *) cstr.text);
	  free (CONST_CAST (unsigned char *, cstr.text));
	}
    }
#endif
}

/* Called at the start of every non-empty line.  TOKEN is the first
   lexed token on the line.  Used for diagnostic line numbers.  */
static void
cb_line_change (cpp_reader * ARG_UNUSED (pfile), const cpp_token *token,
		int parsing_args)
{
  if (token->type != CPP_EOF && !parsing_args)
    input_location = token->src_loc;
}

void
jal_fe_file_change (const struct line_map *new_map)
{
  if (new_map == NULL)
    return;

  if (new_map->reason == LC_ENTER)
    {
      /* Don't stack the main buffer on the input stack;
	 we already did in compile_file.  */
      if (!MAIN_FILE_P (new_map))
	{
	  unsigned int included_at = LAST_SOURCE_LINE_LOCATION (new_map - 1);
	  int line = 0;
	  if (included_at > BUILTINS_LOCATION)
	    line = SOURCE_LINE (new_map - 1, included_at);

	  input_location = new_map->start_location;
	  (*debug_hooks->start_source_file) (line, new_map->to_file);
#ifndef NO_IMPLICIT_EXTERN_C
	  if (c_header_level)
	    ++c_header_level;
	  else if (new_map->sysp == 2)
	    {
	      c_header_level = 1;
	      ++pending_lang_change;
	    }
#endif
	}
    }
  else if (new_map->reason == LC_LEAVE)
    {
#ifndef NO_IMPLICIT_EXTERN_C
      if (c_header_level && --c_header_level == 0)
	{
	  if (new_map->sysp == 2)
	    warning (0, "badly nested C headers from preprocessor");
	  --pending_lang_change;
	}
#endif
      input_location = new_map->start_location;

      (*debug_hooks->end_source_file) (new_map->to_line);
    }

  update_header_times (new_map->to_file);
  input_location = new_map->start_location;
}

static void
cb_def_pragma (cpp_reader *pfile, source_location loc)
{
  /* Issue a warning message if we have been asked to do so.  Ignore
     unknown pragmas in system headers unless an explicit
     -Wunknown-pragmas has been given.  */
  if (warn_unknown_pragmas > in_system_header)
    {
      const unsigned char *space, *name;
      const cpp_token *s;
      location_t fe_loc = loc;

      space = name = (const unsigned char *) "";
      s = cpp_get_token (pfile);
      if (s->type != CPP_EOF)
	{
	  space = cpp_token_as_text (pfile, s);
	  s = cpp_get_token (pfile);
	  if (s->type == CPP_NAME)
	    name = cpp_token_as_text (pfile, s);
	}

      warning (OPT_Wunknown_pragmas, "%Hignoring #pragma %s %s",
	       &fe_loc, space, name);
    }
}

/* #define callback for DWARF and DWARF2 debug info.  */
static void
cb_define (cpp_reader *pfile, source_location loc, cpp_hashnode *node)
{
  const struct line_map *map = linemap_lookup (line_table, loc);
  (*debug_hooks->define) (SOURCE_LINE (map, loc),
			  (const char *) cpp_macro_definition (pfile, node));
}

/* #undef callback for DWARF and DWARF2 debug info.  */
static void
cb_undef (cpp_reader * ARG_UNUSED (pfile), source_location loc,
	  cpp_hashnode *node)
{
  const struct line_map *map = linemap_lookup (line_table, loc);
  (*debug_hooks->undef) (SOURCE_LINE (map, loc),
			 (const char *) NODE_NAME (node));
}



//static int token_buffer_capacity = 0;
//static const cpp_token *token_buffer = NULL;
//
//
//void make_dummy()
//{
//	tok = XNEW (cpp_token);
//	HT_NODE(tok->val.node) = get_identifier ("void");
//   tok->val.node
//
//	token_buffer[0] = tok;
//	ident = 
//
//
//	if ( token_buffer == NULL )
//	{
//		token_buffer_capacity = 1000;
//		token_buffer =  XNEWVEC (const cpp_token, token_buffer_capacity);
//	}
//	if ( false )
//	{
//		token_buffer_capacity = token_buffer_capacity * 2;
//		token_buffer = XRESIZEVEC (const cpp_token *, token_buffer, token_buffer_capacity);
//	}
//
//}

static int insert_main_header = 1;
static int insert_main_footer = 0;
static int sim_idx = -1;

enum cpp_ttype
jal_lex_with_flags_NEW (tree *value, location_t *loc, unsigned char *cpp_flags,
		  int lex_flags)
{
	sim_idx++;
	// fprintf( stderr, "SIM MODE: getting sim_idx: %d \n", sim_idx );
	*loc = 0;

	switch ( sim_idx )
	{
		case 0 : *value = get_identifier ("function"); return CPP_NAME;
		case 1 : *value = get_identifier ("main"); return CPP_NAME;
		case 2 : *value = NULL_TREE; return CPP_OPEN_PAREN;
		case 3 : *value = NULL_TREE; return CPP_CLOSE_PAREN;
		case 4 : *value = get_identifier ("return"); return CPP_NAME;
		case 5 : 
			{
				*value = get_identifier ("sdword"); 
				return CPP_NAME;
			}
		case 6 :  
				 {
					*value = get_identifier ("is");
					insert_main_header = 0;
					return CPP_NAME;
				 }

		case 7 : *value = get_identifier ("return"); return CPP_NAME;
		case 8 : 
			{
				tree int_type = integer_types[itk_int];
				*value = build_int_cst_wide (int_type, 0, 0); return CPP_NUMBER;
			}
		case 9  : *value = get_identifier ("end"); return CPP_NAME;
		case 10 : *value = get_identifier ("function"); return CPP_NAME;
		default:
			*value = NULL_TREE; return CPP_EOF;
	}
}


/* Returns the narrowest C-visible unsigned type, starting with the
   minimum specified by FLAGS, that can fit HIGH:LOW, or itk_none if
   there isn't one.  */

static enum integer_type_kind
narrowest_unsigned_type (unsigned HOST_WIDE_INT low,
			 unsigned HOST_WIDE_INT high,
			 unsigned int flags)
{
  int itk;

  if ((flags & CPP_N_WIDTH) == CPP_N_SMALL)
    itk = itk_unsigned_int;
  else if ((flags & CPP_N_WIDTH) == CPP_N_MEDIUM)
    itk = itk_unsigned_long;
  else
    itk = itk_unsigned_long_long;

  for (; itk < itk_none; itk += 2 /* skip unsigned types */)
    {
      tree upper = TYPE_MAX_VALUE (integer_types[itk]);

      if ((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (upper) > high
	  || ((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (upper) == high
	      && TREE_INT_CST_LOW (upper) >= low))
	return (enum integer_type_kind) itk;
    }

  return itk_none;
}

/* Ditto, but narrowest signed type.  */
static enum integer_type_kind
narrowest_signed_type (unsigned HOST_WIDE_INT low,
		       unsigned HOST_WIDE_INT high, unsigned int flags)
{
  int itk;

  if ((flags & CPP_N_WIDTH) == CPP_N_SMALL)
    itk = itk_int;
  else if ((flags & CPP_N_WIDTH) == CPP_N_MEDIUM)
    itk = itk_long;
  else
    itk = itk_long_long;


  for (; itk < itk_none; itk += 2 /* skip signed types */)
    {
      tree upper = TYPE_MAX_VALUE (integer_types[itk]);

      if ((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (upper) > high
	  || ((unsigned HOST_WIDE_INT) TREE_INT_CST_HIGH (upper) == high
	      && TREE_INT_CST_LOW (upper) >= low))
	return (enum integer_type_kind) itk;
    }

  return itk_none;
}

/* Interpret TOKEN, an integer with FLAGS as classified by cpplib.  */
//static tree
//interpret_integer (const cpp_token *token, unsigned int flags)
//{
//  tree value, type;
//  enum integer_type_kind itk;
//  cpp_num integer;
//  // cpp_options *options = cpp_get_options (parse_in);
//
//  integer = cpp_interpret_integer (parse_in, token, flags);
//  //integer = cpp_num_sign_extend (integer, options->precision);
//
//  /* The type of a constant with a U suffix is straightforward.  */
//  if (flags & CPP_N_UNSIGNED)
//    itk = narrowest_unsigned_type (integer.low, integer.high, flags);
//  else
//    {
//      /* The type of a potentially-signed integer constant varies
//	 depending on the base it's in, the standard in use, and the
//	 length suffixes.  */
//      enum integer_type_kind itk_u
//	= narrowest_unsigned_type (integer.low, integer.high, flags);
//      enum integer_type_kind itk_s
//	= narrowest_signed_type (integer.low, integer.high, flags);
//
//      /* In both C89 and C99, octal and hex constants may be signed or
//	 unsigned, whichever fits tighter.  We do not warn about this
//	 choice differing from the traditional choice, as the constant
//	 is probably a bit pattern and either way will work.  */
//      if ((flags & CPP_N_RADIX) != CPP_N_DECIMAL)
//	itk = MIN (itk_u, itk_s);
//      else
//	{
//	  /* In C99, decimal constants are always signed.
//	     In C89, decimal constants that don't fit in long have
//	     undefined behavior; we try to make them unsigned long.
//	     In GCC's extended C89, that last is true of decimal
//	     constants that don't fit in long long, too.  */
//
//	  itk = itk_s;
//	  if (itk_s > itk_u && itk_s > itk_long)
//	    {
//	      if (!flag_isoc99)
//		{
//		  if (itk_u < itk_unsigned_long)
//		    itk_u = itk_unsigned_long;
//		  itk = itk_u;
//		  warning (0, "this decimal constant is unsigned only in ISO C90");
//		}
//	      else
//		warning (OPT_Wtraditional,
//			 "this decimal constant would be unsigned in ISO C90");
//	    }
//	}
//    }
//
//  if (itk == itk_none)
//    /* cpplib has already issued a warning for overflow.  */
//    type = ((flags & CPP_N_UNSIGNED)
//	    ? widest_unsigned_literal_type_node
//	    : widest_integer_literal_type_node);
//  else
//    type = integer_types[itk];
//
//  if (itk > itk_unsigned_long
//      && (flags & CPP_N_WIDTH) != CPP_N_LARGE
//      && !in_system_header && !flag_isoc99)
//    pedwarn (input_location, 0, "integer constant is too large for %qs type",
//	     (flags & CPP_N_UNSIGNED) ? "unsigned long" : "long");
//
//  value = build_int_cst_wide (type, integer.low, integer.high);
//
//  /* Convert imaginary to a complex type.  */
//  if (flags & CPP_N_IMAGINARY)
//    value = build_complex (NULL_TREE, build_int_cst (type, 0), value);
//
//  return value;
//}

/* Interpret TOKEN, a floating point number with FLAGS as classified
   by cpplib.  */
//static tree
//interpret_float (const cpp_token *token, unsigned int flags)
//{
//  tree type;
//  tree value;
//  REAL_VALUE_TYPE real;
//  char *copy;
//  size_t copylen;
//
//  /* Decode _Fract and _Accum.  */
//  if (flags & CPP_N_FRACT || flags & CPP_N_ACCUM)
//    return interpret_fixed (token, flags);
//
//  /* Decode type based on width and properties. */
//  if (flags & CPP_N_DFLOAT)
//    if ((flags & CPP_N_WIDTH) == CPP_N_LARGE)
//      type = dfloat128_type_node;
//    else if ((flags & CPP_N_WIDTH) == CPP_N_SMALL)
//      type = dfloat32_type_node;
//    else
//      type = dfloat64_type_node;
//  else
//    if (flags & CPP_N_WIDTH_MD)
//      {
//	char suffix;
//	enum machine_mode mode;
//
//	if ((flags & CPP_N_WIDTH_MD) == CPP_N_MD_W)
//	  suffix = 'w';
//	else
//	  suffix = 'q';
//
//	mode = targetm.c.mode_for_suffix (suffix);
//	if (mode == VOIDmode)
//	  {
//	    error ("unsupported non-standard suffix on floating constant");
//	    errorcount++;
//
//	    return error_mark_node;
//	  }
//	else
//	  pedwarn (input_location, OPT_pedantic, "non-standard suffix on floating constant");
//
//	type = c_common_type_for_mode (mode, 0);
//	gcc_assert (type);
//      }
//    else if ((flags & CPP_N_WIDTH) == CPP_N_LARGE)
//      type = long_double_type_node;
//    else if ((flags & CPP_N_WIDTH) == CPP_N_SMALL
//	     || flag_single_precision_constant)
//      type = float_type_node;
//    else
//      type = double_type_node;
//
//  /* Copy the constant to a nul-terminated buffer.  If the constant
//     has any suffixes, cut them off; REAL_VALUE_ATOF/ REAL_VALUE_HTOF
//     can't handle them.  */
//  copylen = token->val.str.len;
//  if (flags & CPP_N_DFLOAT) 
//    copylen -= 2;
//  else 
//    {
//      if ((flags & CPP_N_WIDTH) != CPP_N_MEDIUM)
//	/* Must be an F or L or machine defined suffix.  */
//	copylen--;
//      if (flags & CPP_N_IMAGINARY)
//	/* I or J suffix.  */
//	copylen--;
//    }
//
//  copy = (char *) alloca (copylen + 1);
//  memcpy (copy, token->val.str.text, copylen);
//  copy[copylen] = '\0';
//
//  real_from_string3 (&real, copy, TYPE_MODE (type));
//
//  /* Both C and C++ require a diagnostic for a floating constant
//     outside the range of representable values of its type.  Since we
//     have __builtin_inf* to produce an infinity, this is now a
//     mandatory pedwarn if the target does not support infinities.  */
//  if (REAL_VALUE_ISINF (real)) 
//    {
//      if (!MODE_HAS_INFINITIES (TYPE_MODE (type)))
//	pedwarn (input_location, 0, "floating constant exceeds range of %qT", type);
//      else
//	warning (OPT_Woverflow, "floating constant exceeds range of %qT", type);
//    }
//  /* We also give a warning if the value underflows.  */
//  else if (REAL_VALUES_EQUAL (real, dconst0))
//    {
//      REAL_VALUE_TYPE realvoidmode;
//      int overflow = real_from_string (&realvoidmode, copy);
//      if (overflow < 0 || !REAL_VALUES_EQUAL (realvoidmode, dconst0)) 
//	warning (OPT_Woverflow, "floating constant truncated to zero");
//    }
//
//  /* Create a node with determined type and value.  */
//  value = build_real (type, real);
//  if (flags & CPP_N_IMAGINARY)
//    value = build_complex (NULL_TREE, convert (type, integer_zero_node), value);
//
//  return value;
//}

/* Interpret TOKEN, a fixed-point number with FLAGS as classified
   by cpplib.  */

//static tree
//interpret_fixed (const cpp_token *token, unsigned int flags)
//{
//  tree type;
//  tree value;
//  FIXED_VALUE_TYPE fixed;
//  char *copy;
//  size_t copylen;
//
//  copylen = token->val.str.len;
//
//  if (flags & CPP_N_FRACT) /* _Fract.  */
//    {
//      if (flags & CPP_N_UNSIGNED) /* Unsigned _Fract.  */
//	{
//	  if ((flags & CPP_N_WIDTH) == CPP_N_LARGE)
//	    {
//	      type = unsigned_long_long_fract_type_node;
//	      copylen -= 4;
//	    }
//	  else if ((flags & CPP_N_WIDTH) == CPP_N_MEDIUM)
//	    {
//	      type = unsigned_long_fract_type_node;
//	      copylen -= 3;
//	    }
//	  else if ((flags & CPP_N_WIDTH) == CPP_N_SMALL)
//	    {
//	      type = unsigned_short_fract_type_node;
//	      copylen -= 3;
//	    }
//          else
//	    {
//	      type = unsigned_fract_type_node;
//	      copylen -= 2;
//	    }
//	}
//      else /* Signed _Fract.  */
//	{
//	  if ((flags & CPP_N_WIDTH) == CPP_N_LARGE)
//	    {
//	      type = long_long_fract_type_node;
//	      copylen -= 3;
//	    }
//	  else if ((flags & CPP_N_WIDTH) == CPP_N_MEDIUM)
//	    {
//	      type = long_fract_type_node;
//	      copylen -= 2;
//	    }
//	  else if ((flags & CPP_N_WIDTH) == CPP_N_SMALL)
//	    {
//	      type = short_fract_type_node;
//	      copylen -= 2;
//	    }
//          else
//	    {
//	      type = fract_type_node;
//	      copylen --;
//	    }
//	  }
//    }
//  else /* _Accum.  */
//    {
//      if (flags & CPP_N_UNSIGNED) /* Unsigned _Accum.  */
//	{
//	  if ((flags & CPP_N_WIDTH) == CPP_N_LARGE)
//	    {
//	      type = unsigned_long_long_accum_type_node;
//	      copylen -= 4;
//	    }
//	  else if ((flags & CPP_N_WIDTH) == CPP_N_MEDIUM)
//	    {
//	      type = unsigned_long_accum_type_node;
//	      copylen -= 3;
//	    }
//	  else if ((flags & CPP_N_WIDTH) == CPP_N_SMALL)
//	    {
//	      type = unsigned_short_accum_type_node;
//	      copylen -= 3;
//	     }
//	  else
//	    {
//	      type = unsigned_accum_type_node;
//	      copylen -= 2;
//	    }
//	}
//      else /* Signed _Accum.  */
//        {
//	  if ((flags & CPP_N_WIDTH) == CPP_N_LARGE)
//	    {
//	      type = long_long_accum_type_node;
//	      copylen -= 3;
//	    }
//	  else if ((flags & CPP_N_WIDTH) == CPP_N_MEDIUM)
//	    {
//	      type = long_accum_type_node;
//	      copylen -= 2;
//	    }
//	  else if ((flags & CPP_N_WIDTH) == CPP_N_SMALL)
//	    {
//	      type = short_accum_type_node;
//	      copylen -= 2;
//	    }
//	  else
//	    {
//	      type = accum_type_node;
//	      copylen --;
//	    }
//	}
//    }
//
//  copy = (char *) alloca (copylen + 1);
//  memcpy (copy, token->val.str.text, copylen);
//  copy[copylen] = '\0';
//
//  fixed_from_string (&fixed, copy, TYPE_MODE (type));
//
//  /* Create a node with determined type and value.  */
//  value = build_fixed (type, fixed);
//
//  return value;
//}

/* Convert a series of STRING, WSTRING, STRING16 and/or STRING32 tokens
   into a tree, performing string constant concatenation.  TOK is the
   first of these.  VALP is the location to write the string into.
   OBJC_STRING indicates whether an '@' token preceded the incoming token.
   Returns the CPP token type of the result (CPP_STRING, CPP_WSTRING,
   CPP_STRING32, CPP_STRING16, or CPP_OBJC_STRING).

   This is unfortunately more work than it should be.  If any of the
   strings in the series has an L prefix, the result is a wide string
   (6.4.5p4).  Whether or not the result is a wide string affects the
   meaning of octal and hexadecimal escapes (6.4.4.4p6,9).  But escape
   sequences do not continue across the boundary between two strings in
   a series (6.4.5p7), so we must not lose the boundaries.  Therefore
   cpp_interpret_string takes a vector of cpp_string structures, which
   we must arrange to provide.  */

//static enum cpp_ttype
//lex_string (const cpp_token *tok, tree *valp, bool objc_string, bool translate)
//{
//  tree value;
//  size_t concats = 0;
//  struct obstack str_ob;
//  cpp_string istr;
//  enum cpp_ttype type = tok->type;
//
//  /* Try to avoid the overhead of creating and destroying an obstack
//     for the common case of just one string.  */
//  cpp_string str = tok->val.str;
//  cpp_string *strs = &str;
//
// retry:
//  tok = cpp_get_token (parse_in);
//  switch (tok->type)
//    {
//    case CPP_PADDING:
//      goto retry;
//    case CPP_ATSIGN:
//      if (c_dialect_objc ())
//	{
//	  objc_string = true;
//	  goto retry;
//	}
//      /* FALLTHROUGH */
//
//    default:
//      break;
//
//    case CPP_WSTRING:
//    case CPP_STRING16:
//    case CPP_STRING32:
//      if (type != tok->type)
//	{
//	  if (type == CPP_STRING)
//	    type = tok->type;
//	  else
//	    error ("unsupported non-standard concatenation of string literals");
//	}
//
//    case CPP_STRING:
//      if (!concats)
//	{
//	  gcc_obstack_init (&str_ob);
//	  obstack_grow (&str_ob, &str, sizeof (cpp_string));
//	}
//
//      concats++;
//      obstack_grow (&str_ob, &tok->val.str, sizeof (cpp_string));
//      goto retry;
//    }
//
//  /* We have read one more token than we want.  */
//  _cpp_backup_tokens (parse_in, 1);
//  if (concats)
//    strs = XOBFINISH (&str_ob, cpp_string *);
//
//  if (concats && !objc_string && !in_system_header)
//    warning (OPT_Wtraditional,
//	     "traditional C rejects string constant concatenation");
//
//  if ((translate
//       ? cpp_interpret_string : cpp_interpret_string_notranslate)
//      (parse_in, strs, concats + 1, &istr, type))
//    {
//      value = build_string (istr.len, (const char *) istr.text);
//      free (CONST_CAST (unsigned char *, istr.text));
//    }
//  else
//    {
//      /* Callers cannot generally handle error_mark_node in this context,
//	 so return the empty string instead.  cpp_interpret_string has
//	 issued an error.  */
//      switch (type)
//	{
//	default:
//	case CPP_STRING:
//	  value = build_string (1, "");
//	  break;
//	case CPP_STRING16:
//	  value = build_string (TYPE_PRECISION (char16_type_node)
//				/ TYPE_PRECISION (char_type_node),
//				"\0");  /* char16_t is 16 bits */
//	  break;
//	case CPP_STRING32:
//	  value = build_string (TYPE_PRECISION (char32_type_node)
//				/ TYPE_PRECISION (char_type_node),
//				"\0\0\0");  /* char32_t is 32 bits */
//	  break;
//	case CPP_WSTRING:
//	  value = build_string (TYPE_PRECISION (wchar_type_node)
//				/ TYPE_PRECISION (char_type_node),
//				"\0\0\0");  /* widest supported wchar_t
//					       is 32 bits */
//	  break;
//        }
//    }
//
//
//
//  switch (type)
//    {
//    default:
//    case CPP_STRING:
//      TREE_TYPE (value) = char_array_type_node;
//      break;
//    case CPP_STRING16:
//      TREE_TYPE (value) = char16_array_type_node;
//      break;
//    case CPP_STRING32:
//      TREE_TYPE (value) = char32_array_type_node;
//      break;
//    case CPP_WSTRING:
//      TREE_TYPE (value) = wchar_array_type_node;
//    }
//  *valp = fix_string_type (value);
//
//  if (concats)
//    obstack_free (&str_ob, 0);
//
//  return objc_string ? CPP_OBJC_STRING : type;
//}



/* Converts a (possibly wide) character constant token into a tree.  */
//static tree
//lex_charconst (const cpp_token *token)
//{
//  cppchar_t result;
//  tree type, value;
//  unsigned int chars_seen;
//  int unsignedp = 0;
//
//  result = cpp_interpret_charconst (parse_in, token,
//				    &chars_seen, &unsignedp);
//
//  if (token->type == CPP_WCHAR)
//    type = wchar_type_node;
//  else if (token->type == CPP_CHAR32)
//    type = char32_type_node;
//  else if (token->type == CPP_CHAR16)
//    type = char16_type_node;
//  /* In C, a character constant has type 'int'.
//     In C++ 'char', but multi-char charconsts have type 'int'.  */
//  else if (!c_dialect_cxx () || chars_seen > 1)
//    type = integer_type_node;
//  else
//    type = char_type_node;
//
//  /* Cast to cppchar_signed_t to get correct sign-extension of RESULT
//     before possibly widening to HOST_WIDE_INT for build_int_cst.  */
//  if (unsignedp || (cppchar_signed_t) result >= 0)
//    value = build_int_cst_wide (type, result, 0);
//  else
//    value = build_int_cst_wide (type, (cppchar_signed_t) result, -1);
//
//  return value;
//}

enum cpp_ttype jal_lex_next_token_loc(tree *value, location_t *loc, unsigned char *cpp_flags, int lex_flags)
{
	JAL_CPP_TOKEN jal_pp_token;

	*loc = 0;
	*value = NULL_TREE;

	if ( insert_main_header || insert_main_footer)
	{
		// fprintf( stderr, "INSERTING MAIN HEADER OR FOOTER !!!!!!!!\n" );
		return jal_lex_with_flags_NEW (value, loc, cpp_flags, lex_flags );
	}

restart_after_include:

	jal_pp_token = jal_pp_next_token( false );
	*loc = jal_pp_token.location;
	
	if ( option_lexer_trace != 0 )
	{
		print_jal_token( &jal_pp_token );
	}

	if ( jal_pp_token.id == CPP_NAME )
	{
		if ( jal_pp_token.token_size == 7 )
		{
			if ( 0 == memcmp( jal_pp_token.token_string, "include", 7 ) )
			{
				jal_lexer_trace( "GOT INCLUDE\n" ); 
				jal_pp_token = jal_pp_next_token( true );
				if ( option_lexer_trace != 0 )
				{
					print_jal_token( &jal_pp_token );
				}

				if ( jal_pp_token.id == CPP_NAME )
				{
					char* new_filename = jal_alloc( jal_pp_token.token_size + 5 );

					memcpy( new_filename, jal_pp_token.token_string, jal_pp_token.token_size );
					new_filename[ jal_pp_token.token_size    ] = '.';
					new_filename[ jal_pp_token.token_size +1 ] = 'j';
					new_filename[ jal_pp_token.token_size +2 ] = 'a';
					new_filename[ jal_pp_token.token_size +3 ] = 'l';
					new_filename[ jal_pp_token.token_size +4 ] = '\0';
					
					jal_lexer_trace( "GOT INCLUDE FILENAME :%s:\n", new_filename ); 

					if ( !jal_pp_set_filename(new_filename) )
					{
						jal_lexer_trace( "Failed to open INCLUDE FILENAME :%s:\n", new_filename ); 
					}
					else
					{
						jal_lexer_trace( "Suc6 to open INCLUDE FILENAME :%s:\n", new_filename ); 
					}
				}
				else
				{
					error ( "expected filename after include\n" ); 
				}
				goto restart_after_include;
			}
		}
		*value = get_identifier_with_length( jal_pp_token.token_string, jal_pp_token.token_size);
	}

	if ( jal_pp_token.id == CPP_EOF )
	{
		// AF switch to previous file, until at root of include chain
		// linemap_add (line_table, LC_RENAME, false, fileName, 1);

		// fprintf( stderr, "GOT EOF, INSERTING FOOTER !!!!!!!!\n" );
		insert_main_footer = 1;
		return jal_lex_with_flags_NEW (value, loc, cpp_flags, lex_flags );
	}
	if ( jal_pp_token.id == CPP_STRING )
	{
	jal_lexer_do_trace( "Lexing string constant " );
	  if ( jal_pp_token.token_size >1 )
	  {
	jal_lexer_do_trace( "Lexing %d characters ",  jal_pp_token.token_size );
		*value = build_string (jal_pp_token.token_size, jal_pp_token.token_string);
		TREE_TYPE (*value) = char_array_type_node;
	  }
	  else
	  {
		  int low = 0;
		  if ( jal_pp_token.token_size > 0 )
		  {
			  low = (int)jal_pp_token.token_string[0]; 
			jal_lexer_do_trace( "Lexing 1 characters, value is %d ",  low );
		  }
		  *value = build_int_cst_wide (char_type_node, low, 0);
		  jal_pp_token.id = CPP_CHAR;
			jal_lexer_do_trace( "Lexed 0,1 characters, value is %d ",  low );
	  }

	}
	if ( jal_pp_token.id == CPP_NUMBER )
	{
		int radix = 10;
		int pos = 0;
		tree int_type = NULL_TREE;
	
		unsigned int low = 0;

		if ( jal_pp_token.token_size>= 2 )
		{

			if ( ( jal_pp_token.token_string[0] == '0' ) && ( jal_pp_token.token_string[1] == 'x' ) )
			{
				pos = 2;
				radix = 16;
			}
			if ( ( jal_pp_token.token_string[0] == '0' ) && ( jal_pp_token.token_string[1] == 'b' ) )
			{
				pos = 2;
				radix = 2;
			}
			if ( ( jal_pp_token.token_string[0] == '0' ) && ( jal_pp_token.token_string[1] == 'q' ) )
			{
				pos = 2;
				radix = 8;
			}
		}

		if ( pos >= jal_pp_token.token_size )
		{
			// AF TODO
			error ( "zero length number" );
		}

		while ( pos < jal_pp_token.token_size )
		{
			char ch = jal_pp_token.token_string[ pos ];

			if  ( radix == 2 )
			{
				if  ( ch >= '0' &&  ch <= '1' )
				{
					low = low * radix;
					low = low + ch - '0';
				}
				else if ( ch == '_' )
				{
				}
				else
				{
					error( "invalid binary number value, expects 0,1" );
					break;
				}
			}
			if  ( radix == 10 )
			{
				if  ( ch >= '0' &&  ch <= '9' )
				{
					low = low * radix;
					low = low + ch - '0';
				}
				else if ( ch == '_' )
				{
				}
				else
				{
					error ( "invalid decimal number value, expects 0..9" );
					break;
				}
			}
			if  ( radix == 8 )
			{
				if  ( ch >= '0' &&  ch <= '7' )
				{
					low = low * radix;
					low = low + ch - '0';
				}
				else if ( ch == '_' )
				{
				}
				else
				{
					error ( "invalid decimal number value, expects 0..9" );
					break;
				}
			}					
			if  ( radix == 16 )
			{
				if  ( ch >= '0' &&  ch <= '9' )
				{
					low = low * radix;
					low = low + ch - '0';
				}
				else if  ( ch >= 'a' &&  ch <= 'f' )
				{
					low = low * radix;
					low = low + ch - 'a' + 10;
				}
				else if ( ch == '_' )
				{
				}
				else
				{
					error ( "invalid decimal number value, expects 0..9, a..f" );
					break;
				}
			}
			pos++;
		}
		//fprintf( stderr, "jal_pp_token.id == CPP_NUMBER LOW IS %d\n", low );
		int_type = integer_types[itk_int];		
		*value = build_int_cst_wide (int_type, low, 0);
	}

	//print_jal_token( &jal_pp_token );

	return jal_pp_token.id;
}
